Covering problem - PDFSEARCH.IO - Document Search Engine

Covering problem
Results: 53

#	Item
41	Multi-Dimensional Commodity Covering for Tariff Selection in Transportation∗ Felix G. König1 , Jannik Matuschke2 , and Alexander Richter2 1 TomTom International BV Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2012-09-11 03:22:31 Operations research NP-complete problems Greedy algorithm Knapsack problem Dynamic programming Sequence container Approximation algorithm Algorithm Optimization problem Theoretical computer science Mathematics Applied mathematics
42	THE GENERALIZED CUSPIDAL COHOMOLOGY PROBLEM ANNEKE BART AND KEVIN P. SCANNELL Abstract. Let Γ ⊂ SO(3, 1) be a lattice. The well-known bending deformations, introduced by Thurston and Apanasov, can be used to construct Add to Reading List Source URL: borel.slu.edu Language: English - Date: 2005-11-18 21:19:18 Algebraic topology Differential geometry Differential topology Kleinian groups Riemann surfaces Orbifold Fuchsian group Geodesic Covering space Abstract algebra Geometry Topology
43	Instance-Sensitive Robustness Guarantees for Sequencing with Unknown Packing and Covering Constraints∗ [Extended Abstract] † ‡ Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-23 03:06:05 Mathematical analysis Knapsack problem Dynamic programming Mathematical optimization Pi Μ operator Operations research Theoretical computer science Applied mathematics
44	Die Titel der Diskussionspapiere von Nr[removed]bis[removed]können bei Bedarf im Fachbereich Wirtschaftswissenschaft angefordert werden: FernUniversität, z Add to Reading List Source URL: www.fernuni-hagen.de Language: English - Date: 2011-12-05 03:57:21 Mathematics Applied mathematics Combinatorial auction Reverse auction Mathematical optimization Set cover problem Covering problem Relaxation Auction Auction theory Auctioneering Business
45	A Robust PTAS for Machine Covering and Packing! Martin Skutella and Jos´e Verschae Institute of Mathematics, TU Berlin, Germany {skutella,verschae}@math.tu-berlin.de Abstract. Minimizing the makespan or maximizing the m Add to Reading List Source URL: page.math.tu-berlin.de Language: English Operations research Approximation algorithms Complexity classes Polynomial-time approximation scheme Job shop scheduling Bin packing problem Time complexity Linear programming David Shmoys Theoretical computer science Computational complexity theory Applied mathematics
46	PDF Document Add to Reading List Source URL: snap.stanford.edu Language: English - Date: 2013-10-24 09:46:06 Graph Centrality Flow network Random graph Shortest path problem Line graph Adjacency matrix Power graph analysis Covering graph Graph theory Mathematics Theoretical computer science
47	A Hamilton Path Heuristic with Applications to the Middle Two Levels Problem Ian Shields IBM P.O. Box[removed]Research Triangle Park, North Carolina 27709, USA Add to Reading List Source URL: www.cybershields.com Language: English - Date: 2006-06-01 22:54:49 NP-complete problems Graph Hamiltonian path Connectivity Symbol Covering graph Graph theory Mathematics Theoretical computer science
48	Covering Collections and a Challenge Problem of Serre E. Victor Flynn, Mathematical Institute, University of Oxford Joseph L. Wetherell†, Department of Mathematics, University of Southern California Abstract We answer Add to Reading List Source URL: people.maths.ox.ac.uk Language: English* - Date: 2006-07-08 18:57:36 Elliptic curve cryptography Elliptic curves Analytic number theory Algebraic curves Elliptic curve Group theory Curve Rational point Rational function Abstract algebra Geometry Algebraic geometry
49	8 Further Topics in Moral Hazard This is designed for one 75-minute lecture using Games and Information. Probably I have more material than I will end up covering. These slides just cover sections 8.1 (efficiency wage), Add to Reading List Source URL: www.rasmusen.org Language: English - Date: 2009-08-27 17:54:53 Organizational theory Principal–agent problem Efficiency wage Economics Incentive Nash equilibrium Information Management Game theory Asymmetric information Market failure
50	A Near-Optimality in Covering Games by Exposing Global Information Maria-Florina Balcan, School of Computer Science, Georgia Institute of Technology Add to Reading List Source URL: www.cc.gatech.edu Language: English - Date: 2014-02-14 15:13:20 Applied mathematics Price of anarchy Nash equilibrium Price of stability Congestion game Algorithmic game theory Vertex cover Outcome Potential game Game theory Problem solving Theoretical computer science

UPDATE